Converting Bases with the Gröbner Walk

نویسندگان

  • Stéphane Collart
  • Michael Kalkbrener
  • Daniel Mall
چکیده

The objective of this note is the presentation of a procedure for converting a given Gröbner basis (Buchberger, 1965) of a polynomial ideal I to a Gröbner basis of I with respect to another term order. This procedure, which we call the Gröbner walk, is completely elementary and does not require any assumptions about the dimension or the number of variables of the ideal. The Gröbner walk breaks up the conversion problem into several simple steps between adjacent Gröbner bases following a path in the Gröbner fan. Since two term orders leading to adjacent Gröbner bases can be viewed as refinements of a common partial order, these simple transformations can be computed working just with the initial forms with respect to this partial order. Because the initial forms typically involve far fewer terms than the polynomials as a whole, the transformations can be computed cheaply. First experiments seem to indicate that the Gröbner walk performs rather well for large classes of examples. It is interesting to note that, although the theoretic concepts on which the algorithm is based are neither new nor complicated, it has not been considered before as a candidate for efficient change of basis, even though there has been some interest in Gröbner basis conversion for some time (see for instance Faugère et al., 1993; Traverso, 1993; Gianni et al., 1994; Faugère, 1994). The main reason for the interest in this question is the obvious demand for fast conversion algorithms. For instance, if for some polynomial ideal a Gröbner basis with respect to some elimination order is sought, it may well be more efficient to compute first a Gröbner basis with respect to a total degree order, and then to convert, since total degree bases are generally much faster to compute. More specialized applications which by nature involve basis conversions might for instance be the implicitization of varieties (Hoffmann, 1989; Licciardi and Mora, 1994; Kalkbrener, 1996) and the inversion of polynomial isomorphisms. The authors are indebted to several sources for their inspiration. The article by Faugère

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Converting between the Popov and the Hermite form of matrices of differential operators using an FGLM-like algorithm

We consider matrices over a ring K [∂; σ, θ ] of Ore polynomials over a skew field K . Since the Popov and Hermite normal forms are both Gröbner bases (for term over position and position over term ordering resp.), the classical FGLM-algorithm provides a method of converting one into the other. In this report we investigate the exact formulation of the FGLM algorithm for not necessarily “zero-d...

متن کامل

The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much...

متن کامل

Walking Through The Gröbner Fan

The Gröbner Walk is an algorithm that transforms a polynomial ideal’s Gröbner basis under one term order into a basis under another order. Although we could always directly compute such a basis using Buchberger’s algorithm, the Gröbner Walk is of special interest because, in many cases, it is much more efficient to convert a basis using this algorithm than to compute it directly. We first discu...

متن کامل

iv : m at h . A C / 0 50 13 45 v 3 1 3 O ct 2 00 5 The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much...

متن کامل

On the Complexity of Gröbner Bases Conversion

In recent years, several algorithms for converting a Gröbner basis (Buchberger, 1965; Buchberger, 1970) for one term order to a Gröbner basis for a different term order have been developed; see, for instance, Faugère et al. (1993), Faugère (1994), Traverso (1996), Noro and Yokoyama (1995) and Collart et al. (1997). The main reason is the obvious demand for fast conversion algorithms. For instan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1997